Distributed matching engine

ABSTRACT

A system includes a plurality of servers that are configured to execute a distributed matching system for the trading of one or more items.

CROSS REFERENCE TO RELATED APPLICATION

This patent application is a continuation application of U.S. patentapplication Ser. No. 16/551,891, filed Aug. 27, 2019 which is acontinuation application of U.S. patent application Ser. No. 13/832,472,filed Mar. 15, 2013, which claims the benefit of U.S. provisionalapplication No. 61/737,553 filed Dec. 14, 2012, the disclosures of whichare hereby incorporated by reference herein in their entirety.

FIELD

Some embodiments relate to matching and/or trading items.

BACKGROUND

Systems may be used for the electronic matching and/or trading of itemsbetween users.

BRIEF DESCRIPTION OF THE FIGURES

FIG. 1 shows an example distributed matching engine according to someembodiments.

DETAILED DESCRIPTION

Referring to FIG. 1, there is shown an example system 100 according toan example embodiment. System 100 may include one or more computingsystems (e.g. servers) 101-106. Computing systems 101-106 may bereferred to herein as servers for purposes of description. However, itshould be understood that the use of the term server is non-limiting,and that other types of computing systems may be used.

Each server 101-106 may include one or more processors and one or morememories, which may include one or more databases. Each server mayinclude one or more network hardware/software/firmware based interfacesthat enable the server to connect to and communicate over network 110.Network 110 may include a public and/or private network(s) and be awired and/or wireless network based on any type of technology. Network110 may also include a bus and/or backplane type architecture. Network110 may include one or more elements including routers, switches, etc.Network 110 may be configured to allow at least each of servers 101-106to communicate with the other. Network 110 may also be configured toallow servers 101-106 to communicate with other computing systems (e.g.,computing system 150) that may be on network 110 or may be on othernetworks not shown in FIG. 1 but are accessible via network 110. As oneexample, network 110 may be a private network that is interfaced to, viaone or more routers/switches/etc for example, one or more other privateand/or public networks thereby allowing, for example, any one of servers101-106 to communicate with other computing systems on such networks.One or more of servers 101-106 and network 110 may be configured tosupport unicast, broadcast, and/or multicast communications. Themulticast communications may include IP multicasting, although othertypes of multicasting may be used. The multicasting may be reliable orunreliable multicasting. One skilled in the art will recognize that theabove description of servers 101-106 and network 110 are merelyexamples, and that additional and/or other server/network configurationsand functionality may be used. For example, in addition to network 110,one or more of servers 101-106 may also include one or more additionalnetwork hardware/software/firmware based interfaces that enable theserver to connect to and communicate over one or more other publicand/or private networks not shown in FIG. 1.

One or more of servers 101-106 within system 100 may be identicallyconfigured and/or substantially identically configured in terms ofhardware (e.g., processor configuration, number of processors, processorspeed, memory size, memory speed, etc.) and/or system software (e.g.,operating system) and/or network interface(s) speed. Similarly, one ormore of server's 101-106 ability to communicate with any other serverover network 110 may be the same. One or more of servers 101-106 may beco-located within the same rack, room, building, etc. In addition, thenetwork elements that make up network 110 may also be co-located withservers 101-106. Again, additional and/or other configurations arepossible. For example, each server may have different performancecapabilities.

System 100 may be referred to as cloud computing system. System 100 maybe owned by and/or partially owned by and/or maintained/operated by oneor more entities that lease or rent the resources of system 100 to oneor more other users/customers, such as users A-F. Users A-F may beindividual people and/or companies, such as banks, investments funds,trading firms, etc. Alternatively and/or in addition, one or more ofusers A-F may own resources of system 100. As an example, server 101 maybe leased to or owned by user A, server 102 may be leased to or owned byuser B, server 103 may be leased to or owned by user C, server 104 maybe leased to or owned by user D, server 105 may be leased to or owned byuser E, and/or server 106 be leased to or owned by user F. In general,each server 101-106 may be assigned to a particular user who has accessto the resources of that server. A given user may be associatedwith/lease/own multiple servers within system 100. According to oneexample, system 100 may be expandable in that additional servers may beadded to the system, which servers may be leased to or owned by uses A-Fand/or new users. System 100 may be configured such that the additionand/or removal of one or more servers may not affect other users. Asanother example, a given server may be leased/rented to multipledifferent users that have no association with one another. The servermay be configure such that use of the server by one of the users doesnot affect the other user, and vise versa.

According to one example, system 100 may operate as and/or be configuredas a trading or matching system and in particular, a distributedtrading/matching system, that allows users, such as users A-F, to tradeand/or buy-sell one or more items with one another. The item(s) tradedon system 100 may be owned by one or more of the users A-F of thesystem. Alternatively and/or in addition, one or more of users A-F maybe principals and/or brokers and/or agents, for example, acting onbehalf of an entity(s) that may own the item(s). The traded items mayinclude tangible and/or intangible items. According to one example,system 100 may be configured to trade one or more financial instruments,including for example, fixed income securities, equities, foreignexchange, etc. Accordingly, each user A-F may use system 100 to tradeone or more financial instruments with one or more other users of thesystem. One skilled in the art will recognize that other types of itemsmay be traded and/or bought/sold via system 100 such as, for example,real-estate (e.g., property, homes, and/or buildings), consumer products(e.g., cars, electronics), tickets (e.g., airline, concert), etc. Oneskilled in the art will recognize that in addition to and/or as analternative to a trading or matching system, system 100 may operateas/be configured as other type(s) of systems.

One or more of servers 101-106 may also include (e.g., have stored in amemory) one or more applications 120 a-f that execute thereon. As anexample, applications 120 a-f may be referred to herein as matchingengines, although other and/or additional types of applications arepossible. Matching engines 120 a-f may enable users A-F to tradebuy/sell items between one another. Matching engines 120 a-f may besoftware and/or firmware and/or hardware based applications that executeon servers 101-106. Each server may include one and/or multiple matchingengines. Each server may include additional and/or other applications.The matching engine(s) of each server 101-106 may be the same and/orsubstantially the same application, or different applications. Forexample, each matching engine may execute a similar matching algorithm.As another example, different matching engines may execute differentmatching algorithms. Matching engines 120 a-f may bedeveloped/maintained by the entity(s) that own/operate system 100. Suchentities may also develop/maintain other and/or additional applicationsthat execute at each server.

Each server may also include one or more applications 122 a-e (e.g.,have stored in a memory) that execute thereon that are associated withusers, such as users A-E. As an example, applications 122 a-e may bereferred to herein as trading applications, although other and/oradditional types of applications are possible. According to anotherexample, one or more trading application(s) (such as application 122 f)may not execute on a server 101-105. Rather, the application may executeon a computing system, such as computing system 130, that is connectedto a server, for example server 106. Computing system 130 may or may notbe co-located with server 106 and/or other elements of system 100.Computing system 130 and server 106 may communicate over one or moreprivate and/or public networks 131. As another example, computing system130 and server 106 may communicate over network 110. According to oneexample, computing system 130 may be owned and operated by an entitythat owns and operates system 100. According to another example,computing system 130 may be owned and operated by the user (here user F)associated with the server to which the computing system is connected.One skilled in the art will recognize that these configurations aremerely examples and other and/or additional configurations are possible.For example, each server 101-105/computing system 130 may include oneand/or multiple trading applications. Each server 101-105/computingsystem 130 may also include additional and/or other applicationsassociated with users, such as users A-F.

According to one example, each trading application 122 a-f mayconfigured to intercommunicate with respective matching engines 120 a-fand thereby enable users A-F of system 100 to trade items. Each tradingapplication 122 a-f may be automated trading algorithms that executestrading strategies, and thereby generates trading orders (e.g., bids,offers, hits, takes) for example, on behalf of the respective users A-F.Each trading application(s) at a given server may be configured to tradeone or more items. Each trading application 122 a-f may be a softwareand/or firmware and/or hardware based application that executes on eachrespective server 101-105/computing system 130. Each trading applicationmay be different from the other trading applications and may bedeveloped by the user to which the respective server is assigned. Forexample, user A may develop trading application 122 a and load/haveloaded that application on server 101 (e.g., through an administrationapplication) where the application executes. Similarly, user B maydevelop trading application 122 b and load/have loaded that applicationon server 102 (e.g., through an administration application) where theapplication executes. In addition to and/or as another example, tradingapplications 122 a-f may be generic applications (such as APIs) providedby the entity(s) that owns/operates system 100. In each instance, eachrespective user A-F may customize its respective application (e.g.,through an API that the user interfaces with either through a computingsystem remote from the respective server, through an administrationapplication, and/or through a user interface device (keyboard/mouse/etc)connected to the respective server, etc.) to meet their needs. Oneskilled in the art will recognize that these configurations are merelyexamples and that other and/or additional configurations are possible.For example, rather than trading applications 122 a-f being automatedtrading algorithms that execute trading strategies, one or more oftrading applications 122 a-f may allow a respective user(s) to interfacewith system 100 and generate orders. For example, a respective user(through a remote computing system and/or through a user interfacedevice (keyboard/mouse/etc) connected to a respective server, etc) maybe able to manually submit orders to a respective matching engine of aserver.

As discussed, matching engines 120 a-f, together with respective tradingapplications 122 a-f, at each server may enable users A-F to trade itemsbetween one another. As one example, a single instance of a matchingengine may be configured to trade one particular item (e.g., the 10yrnote). Accordingly, if a given user A-F desires to trade multipledifferent items (e.g., the 5 and 10yr notes), the respective server mayhave multiple instances of matching engine 120 executing, eachcommunicating with one or more instances of a respective tradingapplication 122. As another example, a single instance of a matchingengine may be configured to trade multiple items, the matching enginecommunicating with one or more instances of a respective tradingapplication. One skilled in the art will recognize that these are merelyexamples and other and/or additional configurations are possible. Forexample, if a given server is being used by multiple different users,the server may have multiple instances of a matching engine configuredto trade the same item, but for different users. For discussion purposesonly, matching engine 120 will be described as enabling the trading ofone item.

According to an example, for a given user A-F that desires to trade agiven item, the matching engine 120 a-f of the respective server maymaintain/be configured to maintain an order book 124 a-f for that itemon the server. As an example, a respective order book may be maintainedwithin memory of the respective server. For example, if each of usersA-E desires to trade a given item, each server 101-105 may have an orderbook 124 a-e for that item. Server 106 may not have an order book forthat item if user F does not desire to trade that item. In this fashion,an order book for a given item may be distributed or decentralizedacross multiple servers. Similarly, if each of users A-E also desires totrade a second item, the matching engine(s) 120 a-e of the respectiveservers 101-105 may also maintain a second order book for the seconditem on the server. One skilled in the art will recognize thatadditional and/or other order book configurations are possible.

According to a further example, for each item that may be traded oversystem 100, that item may be assigned a port (e.g., an Internet Protocol(IP) port) or channel, etc. on network 100. For example, a first itemmay be assigned port “x” and a second item may be assigned port “y”,etc. As further discussed herein, a portion or all communicationsbetween servers 101-106 over network 110 regarding the first item mayoccur via port “x” and similarly, a portion or all communicationsbetween servers 101-106 over network 110 regarding the second item mayoccur via port “y”. According to a further example, if a given user, sayA, desires to trade the first item and the second item, server101/matching engine(s) 120 a may be configured to send and/or receive(and/or listen for, monitor, etc.) messages/commands/information/data onports “x” and “y”. In this fashion, user A (e.g., through tradingapplication 122 a) may send/receive information/data regarding the twoitems. Similarly, for example, if user A desires to trade the first itembut not the second item, server 101/matching engine(s) 120 a may beconfigured to send and/or receive (and/or listen for, monitor, etc.)messages/commands/information/data on port “x” but not on port “y”. Inthis fashion, for example, server 101/user A may choose not to receivemessages/commands/information/data on the second item to which it has noconcern. Similarly, if user A (e.g., through trading application 122 a)later has a desire to receive information on the second item, server101/matching engine(s) 120 a may be configured to send and/or receive(and/or listen for, monitor, etc.) messages on port “y”. According toone example, trading applications 122 a-f (possibly through usercontrol) may determine which items are be traded and/or not be tradedand in this fashion, control the configuration of a respectiveserver/matching engine(s) as to, for example, which port(s) aremonitored and for which items an order book is maintained. As anotherexample, a user (e.g., through an API that the user interfaces witheither through a computing system remote from the respective server,through an administration application, and/or through a user interfacedevice (keyboard/mouse/etc) connected to the respective server, etc.)may control the configuration of a respective server/matching engine(s)as to, for example, which port(s) are monitored and for which items anorder book is maintained.

According to an example operation of system 100, if a user/tradingapplication, such as user A/trading application 122 a, is interested intrading a given item, say item “w”, user A/trading application 122 a maygenerate a bid order or an offer order for item “w” (which order mayinclude a price and/or size). Trading application 122 a may forward theorder to matching engine 120 a, which may place the order in order book124 a (i.e., the order book at server 101 for item “w”). This order isshown in FIG. 1 as order 140 in order book 124 a. According to anexample operation of system 100, since user A generated order 140,matching engine 120 a may be responsible for controlling execution oforders against order 140 (e.g., matching contra-orders against order140). According to a further example operation of system 100, matchingengine 120 a may also multicast order 140 via network 110 over the portassigned to item “w”. The multicasted order may include some designationthat it originated from user A/trading application 122 a/matching engine120 a and/or server 101. For each other user/server on system 100 thatmay have interest in item “w” and has thus been configured to receive onthe port for that item, the respective matching engine may receive order140 and place the order in its respective order book for that item. Forexample, users B/trading application 122 b and user C/tradingapplication 122 c may have interest in item “w” and thus, matchingengines 120 b and 120 c may be configured to receive order 140 and placethe order into respective order books 124 b and 124 c (as shown by 140′and 140″ in FIG. 1). Similarly, matching engines 120 b and 120 c mayrecord some designation that the order originated from user A/tradingapplication 122 a/matching engine 120 a/and/or server 101. Respectivematching engines 120 b and 120 c may also forward information on order140 to respective trading applications 122 b and 122 c and/or users Band C. While order 140 may be made known to users B-C/tradingapplications 120 b-c, the origin of the order (i.e., identity of user A)may or may not be made known, depending on whether system 100 is ananonymous matching system.

Similarly, if user B/trading application 122 b generates an order foritem “w”, trading application 122 b may forward the order to matchingengine 120 b, which may place the order in order book 124 b (i.e., theorder book at server 102 for item “w”). This order is shown in FIG. 1 asorder 142 in order book 124 b. Since user B generated order 142,matching engine 120 b may be responsible for controlling execution oforders against order 142 (e.g., matching contra-orders against order140). Matching engine 120 b may also multicast order 142 via network 110over the port assigned to item “w”. The multicasted order may includesome designation that it originated from user B/trading application 122b/matching engine 120 b/and/or server 102. For each other user/server onsystem 100 that may have interest in item “w” and has thus beenconfigured to receive on the port for that item, the respective matchingengine may receive order 142 and place the order in its respective orderbook for that item. For example, as discussed, since user A/tradingapplication 122 a and user C/trading application 122 c has interest initem “w”, matching engines 120 a and 120 c may receive order 142 andplace the order into respective order books 124 a and 124 c (as shown by142′ and 142″ in FIG. 1). Similarly, matching engines 120 a and 120 cmay record some designation that the order originated from userB/trading application 122 b/matching engines 120 b and/or server 102.Respective matching engines 120 a and 120 c may also forward informationon order 142 to respective trading applications 122 a and 122 c and/orusers A and C.

According to a further example operation of system 100, if userA/trading application 122 a later cancels all or a portion of order 140,it may generate a cancel command for the order, which command may beforwarded to matching engine 120 a. Matching engine 120 a may in turncancel the order from its order book 124 a and also may multicast thecancel command via network 110 over the port assigned to item “w”. Thecancel command may include some designation that it originated from userA/trading application 122 a/matching engines 120 a/and/or server 101such that other servers may know to which order the cancel commandrefers to. For each other user/server that may have interest in item “w”and has thus been configured to receive on the port for that item, therespective matching engine may receive the cancel command and cancel therespective order from its respective order book. For example, matchingengines 120 b-c may receive the cancel command and cancel order 140 fromorder books 124 b-c. Matching engines 120 b-c may also notify tradingapplications 122 b-c and/or users B and C that order 140 is no longeravailable.

Assuming the bid/offer order 140 from A is not canceled, user B/tradingapplication 122 b may generate a tradingcommand/contra-order/counter-order, e.g., hit/take, against the order(which hit/take command may include a price and size) (as anotherexample, the trading command may be a bid or offer that crosseswith/matches with order 140—such as at a certain price). Tradingapplication 122 b may forwarded the trading command to matching engine120 b, which may search its order book 124 b for matching orders, andwhich may recognize/determine that the command matches against at leastorder 140 from user A (matching engine 120 b, recognizing that order 142originated from user B, may not attempt to match the trading commandagainst order 142). In response, matching engine 120 b may multicast thetrading command via network 110 over the port assigned to item “w”. Inaddition to adding some designation that that this trading commandoriginated from user B/trading application 122 b/matching engine 120b/and/or server 102 for example, the trading command may be specificallytagged for/designated for/directed to user A/trading application 122a/server 101/and/or matching engine 120 a, since, as noted, matchingengine 120 a may be responsible for executing against orders thatoriginate from user A/server 101. One skilled in the art will recognizethat other means may be used to notify matching engine 120 a that thetrading command is against an order for which matching engine 120 a maybe responsible for executing against. According to one example operationof system 100, other servers/matching engines may receive themulticasted trading command (e.g., those listening on the port assignedto item “w”) and may ignore the command recognizing the command wasdesignated for user A/trading application 122 a/server 101/and/ormatching engine 120 a. According to another example operation of system100, such servers/matching engines may receive the multicasted tradingcommand and provide notification of the potential trade to theirrespective trading applications and/or users. According to one example,the actual trading command may be encrypted.

According to a further example, if additional orders are in order book124 b not of user B and the trading command from user B/tradingapplication 122 b is of a size that exceeds order 140 and/or is therebyagainst these other order(s), matching engine 120 b may also multicastan additional trading command(s) (tagged for the server etc responsiblefor the additional order(s)) via network 110 over the port assigned toitem “w”. As another alternative, matching engine 120 b may user thesame trading command tagged for user A/trading application 122 a/server101/and/or matching engine 120 a, and also tag it for the server etc.responsible for the additional order(s)). One skilled in the art willrecognize other variations are possible.

Upon receiving the trading command, server 101/matching engine 120 a mayrecognize that the command is tagged for it. Matching engine 120 a maynext determine if order 140 is still available (e.g., has not beencanceled and/or executed against by other users; is still in order book124 a). If still available, matching engine 120 a may execute thetrading command against order 140 by removing order 140 from its orderbook 124 a (or reducing the available quantity of order 140 in the orderbook if all of it is not executed against). Matching engine 120 a mayalso communicate with trading application 122 a and/or user A,indicating that order 140 has been executed against. Furthermore,matching engine 120 a may multicast a trade confirmation message vianetwork 110 over the port assigned to item “w”. The conformation messagemay include an indication as to the amount of order 140 that wasactually executed against. The confirmation message may be specificallytagged for user B/trading application 122 b/matching engine 120 b/and/orserver 102. Upon receiving the confirmation message, matching engine 124b may remove order 140 (or a portion thereof) from its order book 124 b,and may also notify user B and/or trading application 122 b of thematched order. In addition to user B, all other users/servers/matchingengines that have interest in item “w” may receive the confirmationmessage, causing the respective matching engines to remove order 140 (ora portion thereof) from their order books. Such matching engines mayalso notify their respective users and/or trading applications of thematched order. Hence, matching engine 120 c may remove order 140 fromits order book 124 c and also notify trading application 122 c and/oruser C. According to another and/or additional example, in addition tomatching engine 120 a multicasting the confirmation message, it maymulticast some other command (such as cancel command) to cause othermatching engines (like engine 120 c) to remove order 140 from its orderbook. One skilled in the art will recognize that other and/or additionalcommand sequences may be used.

As another example, if matching engine 120 a determines order 140 is notstill available (e.g., has been canceled and/or already executed againstby other users) upon receiving the trading command from user B asdiscussed above, it may multicast a cancel message for order 140 and/ora message specifically designating non-confirmation of the trade and/orthat the trade failed and/or that the trade did not go through, etc(which may be specifically tagged for user B/trading application 122b/matching engine 120 b/and/or server 102). Regardless, the effect ofthe message(s) may be for all applicable matching engines to removeorder 140 from their respective order books. Again, respective tradingapplications and/or users may be notified by their respective matchingengines that command 140 is no longer available. Trading application 122b and/or user B may be specifically notified that the trade failed.

According to another example, after matching engine 120 a may determineorder 140 is still available as discussed above, matching engine 120 amay first communicate with trading application 122 a and/or user A todetermine if there is still a desire to execute against order 140. Ifso, matching engine 120 a may proceed as discussed above with respect togenerating a confirmation message, etc. It not, matching engine 120 amay remove order 140 from its order book 124 a and may then proceed asdiscussed above with respect to generating a cancel and/ornon-confirmation message, resulting in order 140 being removed fromother order books. Again, respective trading applications/users at otherservers may be notified by their respective matching engines thatcommand 140 is no longer available. They may also be notified that whileorder 140 was pending, the respective originator of the order (i.e.,user A) no longer desires to execute against the order. One skilled inthe art will recognize other and/or additional message flows arepossible regarding the execution against or non-execution against order140.

According to a further aspect of the example operation discussed above,if, for example, user C/trading application 122 c generates a tradingcommand against order 140 at a substantially similar time as userB/trading application 122 b as discussed herein, matching engine 120 cmay multicast a trading command via network 110 in similar fashion asmatching engine 120 b. In such an event, matching engine 120 a mayreceive two trading commands against order 140 (one from user B and onefrom user C), each inevitably queued with one before the other,depending on which happens to reach server 101 first. Again, becausematching engine 120 a may be responsible for controlling the executionagainst orders that originate from user A/server 101 (here, e.g., order140), matching engine 120 a may execute order 140 against only one ofuser B and user C (assuming both users have attempted to execute thefull size of order 140), depending on which reaches server 101 first.Matching engine 120 a may send, for example, a non-confirmation againstthe other trading command. As another example, the trading command ofone of user B and user C may be fully executed and the other onlypartially executed if order 140 is not of sufficient size to fill both.One skilled in the art will recognize that other variations arepossible.

One skilled in the art will recognize that the above described exampleoperation of system 100 is an example, and that other and/or additionalexample operations are possible.

According to a further example feature, system 100 may remove a need toproduce drop copies. For example, in matching engine 120 a generating atrade confirmation message as described herein, for example, in additionto other matching engines 120 b-f possibly receiving this message andupdating respective order books 124 b-f, other computing system(s)(represented by computing system 150) connected to network 110 mayreceive these messages. These other computing systems may or may not beassociated with users/customers seekig to use system 100 for tradingitems. For example, computing system 150 may be associated with aclearing house that may clear transactions, such as the exampletransaction between users A and B discussed herein.

According to a further example feature of system 100, if, for example,trading application (such as application 122 e) begins to submit bidsand/or offers, for example, for an item at prices that are off marketand there is a need to stop trading application 122 e and potentiallyremove those bids and offers from the market, server 105 may be takenoff-line. Taking server 105 off-line may include, for example, takingthe entire server off-line, shutting down/halting/suspending matchingengine 120 e, causing matching engine 120 e/server 105 to no longerlisten to/receive on/transmit over the port associated with the item,etc (such as by a command from an administrator). Notably, each actionmay cause trading application 122 e to no longer be able to submitorders. Similarly, because matching engine 120 e is responsible forcontrolling the execution of trading commands against orders submittedby trading application 122 e, each above noted action will causematching engine 120 e to no longer be able to do such. For example,causing matching engine 120 e/server 105 to no longer listen to/receiveon the port associated with the item, matching engine 120 e will notreceive the trading commands. One skilled in the art will recognize thatthese are merely examples, and other and/or additional example featuresof system 100 are possible.

While this disclosure has been described in terms of certain embodimentsand generally associated methods, alterations and permutations of theembodiments and methods will be apparent to those skilled in the art.Accordingly, the above description of example embodiments does notconstrain this disclosure. Other changes, substitutions, and alterationsare also possible without departing from the spirit and scope of thisdisclosure.

The following sections provide a guide to interpreting the presentapplication.

I. Terms

The term “product” means a machine, manufacture and/or composition ofmatter, unless expressly specified otherwise.

The term “process” means a process, algorithm, method or the like,unless expressly specified otherwise.

Each process (whether called a method, algorithm or otherwise)inherently includes one or more steps, and therefore all references to a“step” or “steps” of a process have an inherent antecedent basis in themere description of a process, or in the mere recitation of the term‘process’ or a like term. Accordingly, any reference in a claim to a‘step’ or ‘steps’ of a process has sufficient antecedent basis.

The term “invention” and the like mean “the one or more inventionsdisclosed in this application”, unless expressly specified otherwise.

The terms “an embodiment”, “embodiment”, “embodiments”, “theembodiment”, “the embodiments”, “one or more embodiments”, “someembodiments”, “certain embodiments”, “one embodiment”, “anotherembodiment” and the like mean “one or more (but not all) embodiments ofthe invention”, unless expressly specified otherwise.

The term “variation” of an invention means an embodiment of theinvention, unless expressly specified otherwise.

The term “indication” is used in an extremely broad sense. An“indication” of a thing should be understood to include anything thatmay be used to determine the thing.

An indication of a thing may include an electronic message thatidentifies the thing (e.g., an identification of a widget by a serialnumber affixed to the widget, an identification of a widget by one ormore characteristics of the widget). An indication of a thing mayinclude information that may be used to compute and/or look-up a thing(e.g., information identifying a machine of which a widget is a partthat may be used to determine the widget). An indication of a thing mayspecify things that are related to the thing (e.g., characteristics ofthe thing, a name of the thing, a name of a thing related to the thing).An indication of a thing may not specify things that are related to thething (e.g., a letter “a” may be an indication of a widget of a computersystem that is configured to interpret the letter “a” to identify thewidget). An indication of a thing may include a sign, a symptom, and/ora token of the thing. An indication, for example, may include a code, areference, an example, a link, a signal, and/or an identifier. Anindication of a thing may include information that represents,describes, and/or otherwise is associated with the thing.

A transformation of an indication of a thing may be an indication of thething (e.g., an encrypted indication of a thing may be an indication ofthe thing). An indication of a thing may include the thing itself, acopy of the thing, and/or a portion of the thing. An indication of athing may be meaningless to a thing that is not configured to understandthe indication (e.g., a person may not understand that a letter “a”indicates a widget but it may nonetheless be an indication of the widgetbecause the computer system may determine the widget from the letter“a”). It should be understood that the fact that an indication of athing may be used to determine the thing does not mean that the thing oranything else is determined. An indication of a thing may include anindication of any number of the thing unless specified otherwise. Anindication of a thing may include an indication of other things (e.g.,an electronic message that indicates many things). (Indication can beused as a very broad term in claim language. For example: receiving anindication of a financial instrument.)

The term “represent” means (1) to serve to express, designate, standfor, or denote, as a word, symbol, or the like does; (2) to express ordesignate by some term, character, symbol, or the like; (3) to portrayor depict or present the likeness of, as a picture does; or (4) to serveas a sign or symbol of.

A reference to “another embodiment” in describing an embodiment does notimply that the referenced embodiment is mutually exclusive with anotherembodiment (e.g., an embodiment described before the referencedembodiment), unless expressly specified otherwise. Similarly, the merefact that two (or more) embodiments are referenced does not imply thatthose embodiments are mutually exclusive.

One embodiment of the invention may include or cover or embrace morethan one other embodiment of the invention. For example, a firstembodiment comprising elements a, b, and c may cover a second embodimentthat comprises elements a, b, c, and d as well as a third embodimentcovering elements a, b, c, and e. Similarly, each of the first, second,and third embodiments may cover a fourth embodiment comprising elementsa, b, c, d, and e.

The terms “including”, “comprising” and variations thereof mean“including but not necessarily limited to”, unless expressly specifiedotherwise. Thus, for example, the sentence “the machine includes a redwidget and a blue widget” means the machine includes the red widget andthe blue widget, but may possibly include one or more other items aswell.

The term “consisting of” and variations thereof mean “including and alsolimited to”, unless expressly specified otherwise. Thus, for example,the sentence “the machine consists of a red widget and a blue widget”means the machine includes the red widget and the blue widget, but doesnot include anything else.

The term “compose” and variations thereof mean “to make up theconstituent parts of, component of or member of”, unless expresslyspecified otherwise. Thus, for example, the sentence “the red widget andthe blue widget compose a machine” means the machine includes the redwidget and the blue widget.

The term “exclusively compose” and variations thereof mean “to make upexclusively the constituent parts of, to be the only components of, orto be the only members of”, unless expressly specified otherwise. Thus,for example, the sentence “the red widget and the blue widgetexclusively compose a machine” means the machine consists of the redwidget and the blue widget (i.e. and nothing else).

The terms “a”, “an” and “the” refer to “one or more”, unless expresslyspecified otherwise. Thus, for example, the phrase “a widget” means oneor more widgets, unless expressly specified otherwise. Similarly, afterreciting the phrase “a widget”, a subsequent recitation of the phrase“the widget” means “the one or more widgets”. Accordingly, it should beunderstood that the word “the” may also refer to a specific term havingantecedent basis. For example, if a paragraph mentions “a specificsingle feature” and then refers to “the feature,” then the phrase “thefeature” should be understood to refer to the previously mentioned “aspecific single feature.” (It should be understood that the term “a” in“a specific single feature” refers to “one” specific single feature andnot “one or more” specific single features.)

The term “plurality” means “two or more”, unless expressly specifiedotherwise.

The term “herein” means “in the present application, including anythingwhich may be incorporated by reference”, unless expressly specifiedotherwise.

The phrase “at least one of”, when such phrase modifies a plurality ofthings (such as an enumerated list of things), means any combination ofone or more of those things, unless expressly specified otherwise. Forexample, the phrase “at least one of a widget, a car and a wheel” meanseither (i) a widget, (ii) a car, (iii) a wheel, (iv) a widget and a car,(v) a widget and a wheel, (vi) a car and a wheel, or (vii) a widget, acar and a wheel. The phrase “at least one of”, when such phrase modifiesa plurality of things does not mean “one of each of” the plurality ofthings. For example, the phrase “at least one of a widget, a car and awheel” does not mean “one widget, one car and one wheel”.

Numerical terms such as “one”, “two”, etc. when used as cardinal numbersto indicate quantity of something (e.g., one widget, two widgets), meanthe quantity indicated by that numerical term, but do not mean at leastthe quantity indicated by that numerical term. For example, the phrase“one widget” does not mean “at least one widget”, and therefore thephrase “one widget” does not cover, e.g., two widgets.

The phrase “based on” does not mean “based only on”, unless expresslyspecified otherwise. In other words, the phrase “based on” covers both“based only on” and “based at least on”. The phrase “based at least on”is equivalent to the phrase “based at least in part on”. For example,the phrase “element A is calculated based on element B and element C”covers embodiments where element A is calculated as the product of Btimes C (in other words, A=B×C), embodiments where A is calculated asthe sum of B plus C (in other words, A=B+C), embodiments where A iscalculated as a product of B times C times D, embodiments where A iscalculated as a sum of the square root of B plus C plus D times E, andso on.

The term “represent” and like terms are not exclusive, unless expresslyspecified otherwise. For example, the term “represents” does not mean“represents only”, unless expressly specified otherwise. For example,the phrase “the data represents a credit card number” covers both “thedata represents only a credit card number” and “the data represents acredit card number and the data also represents something else”.

The term “whereby” is used herein only to precede a clause or other setof words that express only the intended result, objective or consequenceof something that is explicitly recited before the term “whereby”. Thus,when the term “whereby” is used in a claim, the clause or other wordsthat the term “whereby” modifies do not establish specific furtherlimitations of the claim or otherwise restrict the meaning or scope ofthe claim.

The terms “e.g.”, “such as” and like terms mean “for example”, and thusdo not limit the term or phrase they explain. For example, in thesentence “the computer sends data (e.g., instructions, a data structure)over the Internet”, the term “e.g.” explains that “instructions” are anexample of “data” that the computer may send over the Internet, and alsoexplains that “a data structure” is an example of “data” that thecomputer may send over the Internet. However, both “instructions” and “adata structure” are merely examples of “data”, and other things besides“instructions” and “a data structure” can be “data”.

The term “respective” and like terms mean “taken individually”. Thus iftwo or more things have “respective” characteristics, then each suchthing has its own characteristic, and these characteristics can bedifferent from each other but need not be. For example, the phrase “eachof two machines has a respective function” means that the first of thetwo machines has a function and the second of the two machines has afunction as well.

The function of the first machine may or may not be the same as thefunction of the second machine.

The term “i.e.” and like terms mean “that is”, and thus limits the termor phrase it explains. For example, in the sentence “the computer sendsdata (i.e., instructions) over the Internet”, the term “i.e.” explainsthat “instructions” are the “data” that the computer sends over theInternet.

A numerical range includes integers and non-integers in the range,unless expressly specified otherwise. For example, the range “1 to 10”includes the integers from 1 to 10 (e.g., 1, 2, 3, 4, . . . 9, 10) andnon-integers (e.g., 1.0031415926, 1.1, 1.2, . . . 1.9).

Where two or more terms or phrases are synonymous (e.g., because of anexplicit statement that the terms or phrases are synonymous), instancesof one such term or phrase does not mean instances of another such termor phrase must have a different meaning. For example, where a statementrenders the meaning of “including” to be synonymous with “including butnot limited to”, the mere usage of the phrase “including but not limitedto” does not mean that the term “including” means something other than“including but not limited to”.

II. Determining

The term “determining” and grammatical variants thereof (e.g., todetermine a price, determining a value, the determination of an objectwhich meets a certain criterion) is used in an extremely broad sense.The term “determining” encompasses a wide variety of actions andtherefore “determining” can include calculating, computing, processing,deriving, investigating, looking up (e.g., looking up in a table, adatabase or another data structure), rendering into electronic format ordigital representation, ascertaining and the like. Also, “determining”can include receiving (e.g., receiving information), accessing (e.g.,accessing data in a memory) and the like. Also, “determining” caninclude resolving, selecting, choosing, establishing, and the like.

The term “determining” does not imply certainty or absolute precision,and therefore “determining” can include estimating, extrapolating,predicting, guessing, averaging and the like.

The term “determining” does not imply that mathematical processing mustbe performed, and does not imply that numerical methods must be used,and does not imply that an algorithm is used.

The term “determining” does not imply that any particular device must beused. For example, a computer need not necessarily perform thedetermining.

The term “determining” may include “calculating”. The term “calculating”should be understood to include performing one or more calculations.Calculating may include computing, processing, and/or deriving.Calculating may be performed by a computing device. For example,calculating a thing may include applying an algorithm to data by acomputer processor and generating the thing as an output of theprocessor.

The term “determining” may include “referencing”. The term “referencing”should be understood to include making one or more reference, e.g., to athing. Referencing may include querying, accessing, selecting, choosing,reading, and/or looking-up. The act of referencing may be performed by acomputing device. For example, referencing a thing may include reading amemory location in which the thing is stored by a processor.

The term “determining” may include “receiving”. For example, receiving athing may include taking in the thing. In some embodiments, receivingmay include acts performed to take in a thing, such as operating anetwork interface through which the thing is taken in. In someembodiments, receiving may be performed without acts performed to takein the thing, such as in a direct memory write or a hard wired circuit.Receiving a thing may include receiving a thing from a remote sourcethat may have calculated the thing.

III. Forms of Sentences

Where a limitation of a first claim would cover one of a feature as wellas more than one of a feature (e.g., a limitation such as “at least onewidget” covers one widget as well as more than one widget), and where ina second claim that depends on the first claim, the second claim uses adefinite article “the” to refer to that limitation (e.g., “the widget”),this mere usage does not imply that the first claim covers only one ofthe feature, and this does not imply that the second claim covers onlyone of the feature (e.g., “the widget” can cover both one widget andmore than one widget).

When an ordinal number (such as “first”, “second”, “third” and so on) isused as an adjective before a term, that ordinal number is used (unlessexpressly specified otherwise) merely to indicate a particular feature,such as to distinguish that particular feature from another feature thatis described by the same term or by a similar term, but that ordinalnumber does not have any other meaning or limiting effect—it is merely aconvenient name. For example, a “first widget” may be so named merely todistinguish it from, e.g., a “second widget”. Thus, the mere usage ofthe ordinal numbers “first” and “second” before the term “widget” doesnot indicate any other relationship between the two widgets, andlikewise does not indicate any other characteristics of either or bothwidgets. For example, the mere usage of the ordinal numbers “first” and“second” before the term “widget” (1) does not indicate that eitherwidget comes before or after any other in order or location; (2) doesnot indicate that either widget occurs or acts before or after any otherin time; and (3) does not indicate that either widget ranks above orbelow any other, as in importance or quality. The mere usage of ordinalnumbers does not define a numerical limit to the features identifiedwith the ordinal numbers. For example, the mere usage of the ordinalnumbers “first” and “second” before the term “widget” does not indicatethat there are exactly two widgets.

When a single device, article or other product is described herein, inanother embodiment more than one device or article (whether or not theycooperate) may alternatively be used in place of the single device orarticle that is described. Accordingly, the functionality that isdescribed as being possessed by a device may alternatively be possessedby more than one device or article (whether or not they cooperate) inanother embodiment.

Similarly, where more than one device, article or other product isdescribed herein (whether or not they cooperate), in another embodimenta single device or article may alternatively be used in place of themore than one device or article that is described. For example, aplurality of computer-based devices may be substituted with a singlecomputer-based device. In some embodiments, such a plurality ofcomputer-based devices may operate together to perform one step of aprocess such as is common in grid computing systems. In someembodiments, such a plurality of computer-based devices may operateprovide added functionality to one another so that the plurality mayoperate to perform one step of a process such as is common in cloudcomputing systems. (Conversely, a single computer-based device may besubstituted with multiple computer-based devices operating incooperation with one another. For example, a single computing device maybe substituted with a server and a workstation in communication with oneanother over the internet) Accordingly, the various functionality thatis described as being possessed by more than one device or article mayalternatively be possessed by a single device or article.

The functionality and/or the features of a single device that isdescribed may, in another embodiment, be alternatively embodied by oneor more other devices which are described but are not explicitlydescribed as having such functionality or features. Thus, otherembodiments need not include the described device itself, but rather caninclude the one or more other devices which would, in those otherembodiments, have such functionality or features.

IV. Disclosed Examples and Terminology are Not Limiting

Neither the Title (set forth at the beginning of the first page of thepresent application) nor the Abstract (set forth at the end of thepresent application) is to be taken as limiting in any way the scope ofthe disclosed invention, is to be used in interpreting the meaning ofany claim or is to be used in limiting the scope of any claim. AnAbstract has been included in this application merely because anAbstract is required under 37 C.F.R. § 1.72(b).

The headings of sections provided in the present application are forconvenience only, and are not to be taken as limiting the disclosure inany way.

Numerous embodiments are described in the present application, and arepresented for illustrative purposes only. The described embodiments arenot, and are not intended to be, limiting in any sense. The disclosedinvention is widely applicable to numerous embodiments, as is readilyapparent from the disclosure. One of ordinary skill in the art willrecognize that the disclosed invention may be practiced with variousmodifications and alterations, such as structural, logical, software,and electrical modifications. Although particular features of thedisclosed invention may be described with reference to one or moreparticular embodiments and/or drawings, it should be understood thatsuch features are not limited to usage in the one or more particularembodiments or drawings with reference to which they are described,unless expressly specified otherwise.

Though an embodiment may be disclosed as including several features,other embodiments of the invention may include fewer than all suchfeatures. Thus, for example, a claim may be directed to less than theentire set of features in a disclosed embodiment, and such claim wouldnot be interpreted as requiring features beyond those features that theclaim expressly recites.

No embodiment of method steps or product elements described in thepresent application constitutes the invention claimed herein, or isessential to the invention claimed herein, or is coextensive with theinvention claimed herein, except where it is either expressly stated tobe so in this specification or (with respect to a claim and theinvention defined by that claim) expressly recited in that claim.

Any preambles of the claims that recite anything other than a statutoryclass shall be interpreted to recite purposes, benefits and possibleuses of the claimed invention, and such preambles shall not be construedto limit the claimed invention.

The present disclosure is not a literal description of all embodimentsof the invention. Also, the present disclosure is not a listing offeatures of the invention which must be present in all embodiments.

All disclosed embodiments are not necessarily covered by the claims(even including all pending, amended, issued and canceled claims). Inaddition, a disclosed embodiment may be (but need not necessarily be)covered by several claims. Accordingly, where a claim (regardless ofwhether pending, amended, issued or canceled) is directed to aparticular embodiment, such is not evidence that the scope of otherclaims do not also cover that embodiment.

Devices that are described as in communication with each other need notbe in continuous communication with each other, unless expresslyspecified otherwise. On the contrary, such devices need only transmit toeach other as necessary or desirable, and may actually refrain fromexchanging data most of the time. For example, a machine incommunication with another machine via the Internet may not transmitdata to the other machine for long period of time (e.g. weeks at atime). In addition, devices that are in communication with each othermay communicate directly or indirectly through one or moreintermediaries. Devices are in communication with one another if theyare capable of at least one-way communication with one another. Forexample, a first device is in communication with a second device if thefirst device is capable of transmitting information to the seconddevice. Similarly, the second device is in communication with the firstdevice if the second device is capable of receiving information from thefirst device.

A description of an embodiment with several components or features doesnot imply that all or even any of such components or features arerequired. On the contrary, a variety of optional components aredescribed to illustrate the wide variety of possible embodiments of thepresent invention. Unless otherwise specified explicitly, no componentor feature is essential or required.

Although process steps, algorithms or the like may be described orclaimed in a particular sequential order, such processes may beconfigured to work in different orders. In other words, any sequence ororder of steps that may be explicitly described or claimed does notnecessarily indicate a requirement that the steps be performed in thatorder. The steps of processes described herein may be performed in anyorder possible. Further, some steps may be performed simultaneouslydespite being described or implied as occurring non-simultaneously(e.g., because one step is described after the other step). Moreover,the illustration of a process by its depiction in a drawing does notimply that the illustrated process is exclusive of other variations andmodifications thereto, does not imply that the illustrated process orany of its steps are necessary to the invention, and does not imply thatthe illustrated process is preferred.

Although a process may be described as including a plurality of steps,that does not imply that all or any of the steps are preferred,essential or required. Various other embodiments within the scope of thedescribed invention include other processes that omit some or all of thedescribed steps. Unless otherwise specified explicitly, no step isessential or required.

Although a process may be described singly or without reference to otherproducts or methods, in an embodiment the process may interact withother products or methods. For example, such interaction may includelinking one business model to another business model. Such interactionmay be provided to enhance the flexibility or desirability of theprocess.

Although a product may be described as including a plurality ofcomponents, aspects, qualities, characteristics and/or features, thatdoes not indicate that any or all of the plurality are preferred,essential or required. Various other embodiments within the scope of thedescribed invention include other products that omit some or all of thedescribed plurality.

An enumerated list of items (which may or may not be numbered) does notimply that any or all of the items are mutually exclusive, unlessexpressly specified otherwise. Likewise, an enumerated list of items(which may or may not be numbered) does not imply that any or all of theitems are comprehensive of any category, unless expressly specifiedotherwise. For example, the enumerated list “a computer, a laptop, and aPDA” does not imply that any or all of the three items of that list aremutually exclusive and does not imply that any or all of the three itemsof that list are comprehensive of any category.

An enumerated list of items (which may or may not be numbered) does notimply that any or all of the items are equivalent to each other orreadily substituted for each other.

All embodiments are illustrative, and do not imply that the invention orany embodiments were made or performed, as the case may be.

V. Computing

It will be readily apparent to one of ordinary skill in the art that thevarious processes described herein may be implemented by, e.g.,appropriately programmed general purpose computers, special purposecomputers and computing devices. Typically a processor (e.g., one ormore microprocessors, one or more microcontrollers, one or more digitalsignal processors) will receive instructions (e.g., from a memory orlike device), and execute those instructions, thereby performing one ormore processes defined by those instructions. Instructions may beembodied in, e.g., one or more computer programs, one or more scripts.

The term “compute” shall mean to determine using a processor inaccordance with a software algorithm.

A “processor” means one or more microprocessors, central processingunits (CPUs), computing devices, microcontrollers, digital signalprocessors, graphics processing units (GPUs) or like devices or anycombination thereof, regardless of the architecture (e.g., chip-levelmultiprocessing or multi-core, RISC, CISC, Microprocessor withoutInterlocked Pipeline Stages, pipelining configuration, simultaneousmultithreading, microprocessor with integrated graphics processing unit,GPGPU).

A “computing device” means one or more microprocessors, centralprocessing units (CPUs), computing devices, microcontrollers, digitalsignal processors, graphics card, mobile gaming device, or like devicesor any combination thereof, regardless of the architecture (e.g.,chip-level multiprocessing or multi-core, RISC, CISC, Microprocessorwithout Interlocked Pipeline Stages, pipelining configuration,simultaneous multithreading).

Thus a description of a process is likewise a description of anapparatus for performing the process. The apparatus that performs theprocess can include, e.g., a processor and those input devices andoutput devices that are appropriate to perform the process. For example,a description of a process is a description of an apparatus comprising aprocessor and memory that stores a program comprising instructions that,when executed by the processor, direct the processor to perform themethod.

The apparatus that performs the process can include a plurality ofcomputing devices that work together to perform the process. Some of thecomputing devices may work together to perform each step of a process,may work on separate steps of a process, may provide underlying servicesthat other computing devices that may facilitate the performance of theprocess. Such computing devices may act under instruction of acentralized authority. In another embodiment, such computing devices mayact without instruction of a centralized authority. Some examples ofapparatus that may operate in some or all of these ways may include gridcomputer systems, cloud computer systems, peer-to-peer computer systems,computer systems configured to provide software as a service, and so on.For example, the apparatus may comprise a computer system that executesthe bulk of its processing load on a remote server but outputs displayinformation to and receives user input information from a local usercomputer, such as a computer system that executes VMware software.

Further, programs that implement such methods (as well as other types ofdata) may be stored and transmitted using a variety of media (e.g.,computer readable media) in a number of manners. In some embodiments,hard-wired circuitry or custom hardware may be used in place of, or incombination with, some or all of the software instructions that canimplement the processes of various embodiments. Thus, variouscombinations of hardware and software may be used instead of softwareonly.

The term “computer-readable medium” refers to any non-transitory medium,a plurality of the same, or a combination of different media, thatparticipate in providing data (e.g., instructions, data structures)which may be read by a computer, a processor or a like device. Such amedium may take many forms, including but not limited to, non-volatilemedia, volatile media, and transmission media. Non-volatile mediainclude, for example, optical or magnetic disks and other persistentmemory. Volatile media include dynamic random access memory (DRAM),which typically constitutes the main memory. Transmission media includecoaxial cables, copper wire and fiber optics, including the wires thatcomprise a system bus coupled to the processor. Transmission media mayinclude or convey acoustic waves, light waves and electromagneticemissions, such as those generated during radio frequency (RF) andinfrared (IR) data communications. Common forms of computer-readablemedia include, for example, a floppy disk, a flexible disk, hard disk,magnetic tape, any other magnetic medium, a CD-ROM, DVD, any otheroptical medium, punch cards, paper tape, any other physical medium withpatterns of holes, a RAM, a PROM, an EPROM, a FLASH-EEPROM, any othermemory chip or cartridge, a carrier wave as described hereinafter, orany other medium from which a computer can read.

The term “tangible computer-readable medium” refers to a“computer-readable medium” that comprises a hardware component, such asoptical or magnetic disks.

Various forms of computer readable media may be involved in carryingdata (e.g. sequences of instructions) to a processor. For example, datamay be (i) delivered from RAM to a processor; (ii) carried over awireless transmission medium; (iii) formatted and/or transmittedaccording to numerous formats, standards or protocols, such as Ethernet(or IEEE 802.3), wireless local area network communication defined bythe IEEE 802.11 specifications whether or not they are approved by theWiFi Alliance, SAP, ATP, Bluetooth™, and TCP/IP, TDMA, CDMA, and 3G;and/or (iv) encrypted to ensure privacy or prevent fraud in any of avariety of ways well known in the art.

The term “database” refers to any electronically-stored collection ofdata that is stored in a retrievable format.

The term “data structure” refers to a database in a hardware machinesuch as a computer.

The term “network” means a series of points or nodes interconnected bycommunication paths. For example, a network can include a plurality ofcomputers or communication devices interconnected by one or more wiredand/or wireless communication paths. Networks can interconnect withother networks and contain subnetworks.

The term “predetermined” means determined beforehand, e.g., before apresent time or a present action. For example, the phrase “displaying apredetermined value” means displaying a value that was determined beforethe act of displaying.

The term “condition” means (1) a premise upon which the fulfillment ofan agreement depends, or (2) something essential to the appearance oroccurrence of something else.

The term “transaction” means (1) an exchange or transfer of goods,services, or funds, or (2) a communicative action or activity involvingtwo parties or things that reciprocally affect or influence each other.

Thus a description of a process is likewise a description of acomputer-readable medium storing a program for performing the process.The computer-readable medium can store (in any appropriate format) thoseprogram elements which are appropriate to perform the method. Forexample, a description of a process is a description of acomputer-readable storage medium that stores a program comprisinginstructions that, when executed by a processor, direct the processor toperform the method.

Just as the description of various steps in a process does not indicatethat all the described steps are required, embodiments of an apparatusinclude a computer or computing device operable to perform some (but notnecessarily all) of the described process.

Likewise, just as the description of various steps in a process does notindicate that all the described steps are required, embodiments of acomputer-readable medium storing a program or data structure include acomputer-readable medium storing a program that, when executed, cancause a processor to perform some (but not necessarily all) of thedescribed process.

Where databases are described, it will be understood by one of ordinaryskill in the art that (i) alternative database structures to thosedescribed may be readily employed, and (ii) other memory structuresbesides databases may be readily employed. Any illustrations ordescriptions of any sample databases presented herein are illustrativearrangements for stored representations of information. Any number ofother arrangements may be employed besides those suggested by, e.g.,tables illustrated in drawings or elsewhere. Similarly, any illustratedentries of the databases represent exemplary information only; one ofordinary skill in the art will understand that the number and content ofthe entries can be different from those described herein. Further,despite any depiction of the databases as tables, other formats(including relational databases, object-based models and/or distributeddatabases) could be used to store and manipulate the data typesdescribed herein. Likewise, object methods or behaviors of a databasecan be used to implement various processes, such as the describedherein. In addition, the databases may, in a known manner, be storedlocally or remotely from a device which accesses data in such adatabase.

Various embodiments can be configured to work in a network environmentincluding a computer that is in communication (e.g., via acommunications network) with one or more devices. The computer maycommunicate with the devices directly or indirectly, via any wired orwireless medium (e.g. the Internet, LAN, WAN or Ethernet, Token Ring, atelephone line, a cable line, a radio channel, an optical communicationsline, commercial on-line service providers, bulletin board systems, asatellite communications link, a combination of any of the above). Eachof the devices may themselves comprise computers or other computingdevices, such as those based on the Intel®, Pentium®, or Centrino™,Atom™ or Core™ processor, that are adapted to communicate with thecomputer. Any number and type of devices may be in communication withthe computer.

In an embodiment, a server computer or centralized authority may not benecessary or desirable. For example, the present invention may, in anembodiment, be practiced on one or more devices without a centralauthority. In such an embodiment, any functions described herein asperformed by the server computer or data described as stored on theserver computer may instead be performed by or stored on one or moresuch devices.

Where a process is described, in an embodiment the process may operatewithout any user intervention. In another embodiment, the processincludes some human intervention (e.g., a step is performed by or withthe assistance of a human).

As used herein, the term “encryption” refers to a process for obscuringor hiding information so that the information is not readilyunderstandable without special knowledge. The process of encryption maytransform raw information, called plaintext, into encrypted information.The encrypted information may be called ciphertext, and the algorithmfor transforming the plaintext into ciphertext may be referred to as acipher. A cipher may also be used for performing the reverse operationof converting the ciphertext back into plaintext. Examples of ciphersinclude substitution ciphers, transposition ciphers, and ciphersimplemented using rotor machines.

In various encryption methods, ciphers may require a supplementary pieceof information called a key. A key may consist, for example, of a stringof bits. A key may be used in conjunction with a cipher to encryptplaintext. A key may also be used in conjunction with a cipher todecrypt ciphertext. In a category of ciphers called symmetric keyalgorithms (e.g., private-key cryptography), the same key is used forboth encryption and decryption. The sanctity of the encryptedinformation may thus depend on the key being kept secret. Examples ofsymmetric key algorithms are DES and AES. In a category of cipherscalled asymmetric key algorithms (e.g., public-key cryptography),different keys are used for encryption and decryption. With anasymmetric key algorithm, any member of the public may use a first key(e.g., a public key) to encrypt plaintext into ciphertext. However, onlythe holder of a second key (e.g., the private key) will be able todecrypt the ciphertext back in to plaintext. An example of an asymmetrickey algorithm is the RSA algorithm.

VI. Continuing Applications

The present disclosure provides, to one of ordinary skill in the art, anenabling description of several embodiments and/or inventions. Some ofthese embodiments and/or inventions may not be claimed in the presentapplication, but may nevertheless be claimed in one or more continuingapplications that claim the benefit of priority of the presentapplication.

Applicants intend to file additional applications to pursue patents forsubject matter that has been disclosed and enabled but not claimed inthe present application. VII. 35 U.S.C. § 112, paragraph 6

In a claim, a limitation of the claim which includes the phrase “meansfor” or the phrase “step for” means that 35 U.S.C. § 112, paragraph 6,applies to that limitation.

In a claim, a limitation of the claim which does not include the phrase“means for” or the phrase “step for” means that 35 U.S.C. § 112,paragraph 6 does not apply to that limitation, regardless of whetherthat limitation recites a function without recitation of structure,material or acts for performing that function. For example, in a claim,the mere use of the phrase “step of” or the phrase “steps of” inreferring to one or more steps of the claim or of another claim does notmean that 35 U.S.C. § 112, paragraph 6, applies to that step(s).

With respect to a means or a step for performing a specified function inaccordance with 35 U.S.C. § 112, paragraph 6, the correspondingstructure, material or acts described in the specification, andequivalents thereof, may perform additional functions as well as thespecified function.

Computers, processors, computing devices and like products arestructures that can perform a wide variety of functions. Such productscan be operable to perform a specified function by executing one or moreprograms, such as a program stored in a memory device of that product orin a memory device which that product accesses. Unless expresslyspecified otherwise, such a program need not be based on any particularalgorithm, such as any particular algorithm that might be disclosed inthe present application. It is well known to one of ordinary skill inthe art that a specified function may be implemented via differentalgorithms, and any of a number of different algorithms would be a meredesign choice for carrying out the specified function.

Therefore, with respect to a means or a step for performing a specifiedfunction in accordance with 35 U.S.C. § 112, paragraph 6, structurecorresponding to a specified function includes any product programmed toperform the specified function. Such structure includes programmedproducts which perform the function, regardless of whether such productis programmed with (i) a disclosed algorithm for performing thefunction, (ii) an algorithm that is similar to a disclosed algorithm, or(iii) a different algorithm for performing the function.

Where there is recited a means for performing a function that is amethod, one structure for performing this method includes a computingdevice (e.g., a general purpose computer) that is programmed and/orconfigured with appropriate hardware to perform that function.

Also included is a computing device (e.g., a general purpose computer)that is programmed and/or configured with appropriate hardware toperform that function via other algorithms as would be understood by oneof ordinary skill in the art.

VIII. Disclaimer

Numerous references to a particular embodiment do not indicate adisclaimer or disavowal of additional, different embodiments, andsimilarly references to the description of embodiments which all includea particular feature do not indicate a disclaimer or disavowal ofembodiments which do not include that particular feature. A cleardisclaimer or disavowal in the present application will be prefaced bythe phrase “does not include” or by the phrase “cannot perform”.

IX. Incorporation By Reference

Any patent, patent application or other document referred to herein isincorporated by reference into this patent application as part of thepresent disclosure, but only for purposes of written description andenablement in accordance with 35 U.S.C. § 112, paragraph 1, and shouldin no way be used to limit, define, or otherwise construe any term ofthe present application, unless without such incorporation by reference,no ordinary meaning would have been ascertainable by a person ofordinary skill in the art. Such person of ordinary skill in the art neednot have been in any way limited by any embodiments provided in thereference. Conversely, the definitions provided in this applicationshould not be used to limit, define, or otherwise construe any term ofany document incorporated herein by reference. The definitions set forthexplicitly in this application are controlling notwithstanding thedescription of particular embodiments that may be incompatible with thedefinition(s).

Any incorporation by reference does not, in and of itself, imply anyendorsement of, ratification of or acquiescence in any statements,opinions, arguments or characterizations contained in any incorporatedpatent, patent application or other document, unless explicitlyspecified otherwise in this patent application.

X. Prosecution History

In interpreting the present application (which includes the claims), oneof ordinary skill in the art refers to the prosecution history of thepresent application, but not to the prosecution history of any otherpatent or patent application, regardless of whether there are otherpatent applications that are considered related to the presentapplication, and regardless of whether there are other patentapplications that share a claim of priority with the presentapplication.

1. (canceled)
 2. A method comprising: controlling, by at least oneprocessor of a first server of a system comprising a plurality ofservers, wherein the plurality of servers is configured forinterconnection by at least one network: maintaining a first order bookfor a first item to be traded; receiving a first order for the firstitem, wherein the first order includes a quantity; placing the firstorder in the first order book, wherein the first server is responsiblefor controlling execution of contra-orders against the first order;communicating the first order over the at least one network byselectively specifying the first order for at least one specified serverof the plurality of servers, in which the at least one specified serverincludes a second server; wherein the second server is configured to:maintain a second order book for the first item; receive the first ordercommunicated by the first server; place the first order in the secondorder book; receive a second order for the first item; determine thesecond order is a contra-order to the first order; and in response todetermining the second order is a contra-order to the first order,communicate the second order to the first server; receiving the secondorder from the second server; determining whether the first order isavailable; when the first order is determined to be available, executinga trade between the first and second orders; removing the first orderfrom the first order book when the second order is for all availablequantity of the first order; communicating a first confirmation messageon the at least one network indicating the first order is tradedagainst; wherein the second server is further configured to: receive thefirst confirmation message; and in response to receiving the firstconfirmation message, remove the first order from the second order bookwhen the second order is for all available quantity of the first order,receive a third order for the first item, wherein the third orderincludes a quantity; place the third order in the second order book,wherein the second server is responsible for controlling execution ofcontra-orders against the third order; and communicate the third orderon the at least one network; receiving the third order communicated bythe second server; placing the third order in the first order book;receiving a fourth order for the first item; determining the fourthorder is a contra-order to the third order; and in response todetermining the fourth order is a contra-order to the third order,communicating the fourth order to the second server; wherein the secondserver is further configured to: receive the fourth order from the firstserver; determine whether the third order is available; when the thirdorder is determined to be available, execute a trade between the thirdand fourth orders; remove the third order from the second order bookwhen the fourth order is for all available quantity of the third order;and communicate a second confirmation message on the at least onenetwork indicating the third order is traded against; receiving thesecond confirmation message from the second server; and in response toreceiving the second confirmation message, removing the third order fromthe first order book when the fourth order is for all available quantityof the third order.
 3. The method of claim 2, wherein the first item isassociated with a port on the at least one network; and whereincommunicating the first order over the at least one network comprises tocommunicating the first order over the port.
 4. The method of claim 3,wherein communicating the first order over the port comprisesmulticasting the first order over the port.
 5. The method of claim 3,wherein the second server is further configured to receive data from theat least one network communicated over the port; and wherein to receivethe first order communicated by the first server comprises to receivethe first order over the port.
 6. The method of claim 5, furthercomprising: controlling, by the at least one processor: maintaining anorder book for a second item to be traded, the second item beingdifferent from the first item, wherein the second item is associatedwith a second port on the at least one network, the second port beingdifferent from the port; and communicating information associated withthe second order over the at least one network using the second port. 7.The method of claim 6, wherein the second server is not configured tomaintain an order book for the second item; and as a result of not beingconfigured to maintain an order book for the second item, the secondserver is not configured to receive information on the second port. 8.The method of claim 2, wherein the first item is associated with a porton the at least one network; and further comprising controlling, by theat least one processor, sending and receiving information over the atleast one network associated with the first item over the port, whereinthe second server is configured to send and receive information over theat least one network associated with the first item over the port;taking the first server off-line, in which taking the first serveroff-line includes configuring the first server to not receiveinformation on the port, wherein when the first server is taken off-lineprior to the second server communicating the second order, not executinga trade between the first and second orders.
 9. The method of claim 2,wherein a third server of the plurality of servers is associated withclearing transactions, wherein the third server is configured to receivethe first confirmation message in order to clear a transaction createdby executing the trade between the first and second orders.
 10. Themethod of claim 2, wherein a first entity at least one of owns oroperates the system; wherein resources of the first server are leased toa second entity; and wherein resources of the second server are leasedto a third entity.
 11. The method of claim 10, further comprising:controlling, by the at least one processor: executing a firstapplication for trading the first item, wherein the first application isconfigured by the second entity; and wherein the second server isfurther configured to execute a second application for trading the firstitem, wherein the second application is configured by the third entity.12. The method of claim 2, further comprising: controlling, by the atleast one processor: decreasing an available quantity of the first orderin the first order book when the second order is for less than allavailable quantity of the first order; and wherein the second server isfurther configured to decrease an available quantity of the first orderin the second order book when the second order is for less than allavailable quantity of the first order.
 13. The method of claim 2, inwhich the plurality of servers includes a third server associated withclearing transactions, wherein the third server is configured to:receive the first confirmation message from the first server in order toclear a transaction created by executing the trade between the first andsecond orders; and receive the second confirmation message from thesecond server in order to clear a transaction created by executing thetrade between the third and fourth orders.
 14. The method of claim 2, inwhich the plurality of servers includes a third server configured to:maintain a fifth order book for the first item; receive the first ordercommunicated by the first server; and place the first order in a thirdorder book.
 15. The method of claim 14, wherein the third server isfurther configured to: receive the first confirmation message; and inresponse to receiving the first confirmation message, remove the firstorder from the third order book when the second order is for allquantity of the first order.
 16. The method of claim 14, wherein whenthe second server communicates the second order on the at least onenetwork, the second server is configured to tag the second order asbeing for the first server; and wherein the third server is furtherconfigured to: receive the second order from the second server; andignore the second order because the second order is tagged for the firstserver.
 17. The method of claim 14, wherein the third server is furtherconfigured to: receive a fifth order for the first item; determine thefifth order is a contra-order to the first order; and in response todetermining the fifth order is a contra-order to the first order,communicate the fifth order to the first server.
 18. The method of claim17, further comprising: controlling, by the at least one processor:removing the first order from the first order book as a result ofexecuting the trade between the first and second orders; receiving thefifth order after receiving the second order; determining the firstorder is not available; and in response to determining that the firstorder is not available, communicating a message on the at least onenetwork that a trade between the first and fifth orders is notconfirmed.
 19. The method of claim 17, further comprising: controlling,by the at least one processor: decreasing an available quantity of thefirst order in the first order book as a result of executing the tradebetween the first and second orders; receiving the fifth order afterreceiving the second order; determining the first order is available;based in part on the first order being available, executing a tradebetween the first and fifth orders; removing the first order from thefirst order book when the fifth order is for all available quantity ofthe first order; and communicating another confirmation message on theat least one network indicating the first order is traded against;wherein the second server is further configured to: receive the anotherconfirmation message; and in response to receiving the anotherconfirmation message, remove the first order from the second order bookwhen the fifth order is for all available quantity of the first order;and wherein the third server is further configured to: receive the firstconfirmation message in response to receiving the first confirmationmessage, decrease an available quantity of the first order in the thirdorder book; receive the another confirmation message; and in response toreceiving the another confirmation message, remove the first order fromthe third order book when the fifth order is for all available quantityof the first order.
 20. The method of claim 2, further comprising:controlling, by the at least one processor: executing an application fortrading the first item, and wherein the first order is received from theapplication; prior to executing the trade between the first and secondorders, communicating with the application to determine whether thefirst order should still be traded against; and executing the tradebetween the first and second orders when the application indicates thefirst order should still be traded against.
 21. The method of claim 20,further comprising: controlling, by the at least one processor: removingthe first order from the first order book when the application indicatesthe first order should not be traded against; and communicating amessage on the at least one network that a trade between the first andsecond orders is not confirmed.